Balanced Vertex Decomposable Simplicial Complexes and their h-vectors

نویسندگان

  • Jennifer Biermann
  • Adam Van Tuyl
چکیده

Given any finite simplicial complex ∆, we show how to construct from a colouring χ of ∆ a new simplicial complex ∆χ that is balanced and vertex decomposable. In addition, the h-vector of ∆χ is precisely the f -vector of ∆. Our construction generalizes the “whiskering” construction of Villarreal, and Cook and Nagel. We also reverse this construction to prove a special case of a conjecture of Cook and Nagel, and Constantinescu and Varbaro on the h-vectors of flag complexes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Vertex Decomposable Simplicial Complexes Associated to Path Graphs

Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...

متن کامل

f-Vectors Implying Vertex Decomposability

We prove that if a pure simplicial complex of dimension d with n facets has the least possible number of (d − 1)-dimensional faces among all complexes with n faces of dimension d, then it is vertex decomposable. This answers a question of J. Herzog and T. Hibi. In fact, we prove a generalization of their theorem using combinatorial methods.

متن کامل

Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable

Provan and Billera defined the notion of weak k-decomposability for pure simplicial complexes in the hopes of bounding the diameter of convex polytopes. They showed the diameter of a weakly k-decomposable simplicial complex ã is bounded above by a polynomial function of the number of k-faces in ã and its dimension. For weakly 0-decomposable complexes, this bound is linear in the number of verti...

متن کامل

On a Conjecture by Kalai

We show that monomial ideals generated in degree two satisfy a conjecture by Eisenbud, Green and Harris. In particular we give a partial answer to a conjecture of Kalai by proving that h-vectors of flag Cohen-Macaulay simplicial complexes are h-vectors of Cohen-Macaulay balanced simplicial complexes.

متن کامل

Algebraic shifting and strongly edge decomposable complexes

Let Γ be a simplicial complex with n vertices, and let ∆(Γ) be either its exterior algebraic shifted complex or its symmetric algebraic shifted complex. If Γ is a simplicial sphere, then it is known that (a) ∆(Γ) is pure and (b) h-vector of Γ is symmetric. Kalai and Sarkaria conjectured that if Γ is a simplicial sphere then its algebraic shifting also satisfies (c) ∆(Γ) ⊂ ∆(C(n, d)), where C(n,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2013